Distribution of generalized Fermat prime numbers
نویسندگان
چکیده
Numbers of the form Fb,n = b 2n+1 are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of a GFN is described which is as fast as testing a number of the form 2m−1. The theoretical distributions of GFN primes, for fixed n, are derived and compared to the actual distributions. The predictions are surprisingly accurate and can be used to support Bateman and Horn’s quantitative form of “Hypothesis H” of Schinzel and Sierpiński. A list of the current largest known GFN primes is included.
منابع مشابه
A Problem on the Conjecture concerning the Distribution of Generalized Fermat Prime Numbers (a New Method for the Search for Large Primes)
Is it possible to improve the convergence properties of the series for the computation of the Cn involved in the distribution of the generalized Fermat prime numbers? If the answer to this question is yes, then the search for a large prime number P will be C · log(P ) times faster than today, where C ≈ 0.01.
متن کاملNotes on Generalized Fermat Numbers
There are two different definitions of generalized Fermat numbers (GFN), one of which is more general than the other. In [5], Ribenboim defines a generalized Fermat number as a number of the form Fa,n = a n + 1 with a > 2, while Riesel ([6]) further generalizes, defining it to be a number of the form a n + b n . Both definitions generalize the usual Fermat numbers Fn = 2 n + 1. The only known F...
متن کاملExtending the Generalized Fermat Prime Number Search Beyond One Million Digits Using GPUs
Great strides have been made in recent years in the search for ever larger prime Generalized Fermat Numbers (GFN). We briefly review the history of the GFN prime search, and describe new implementations of the ‘Genefer’ software (now available as open source) using CUDA and optimised CPU assembler which have underpinned this unprecedented progress. The results of the ongoing search are used to ...
متن کاملOn the Fermat Periods of Natural Numbers
Let b > 1 be a natural number and n ∈ N0. Then the numbers Fb,n := b 2 +1 form the sequence of generalized Fermat numbers in base b. It is well-known that for any natural number N , the congruential sequence (Fb,n (mod N)) is ultimately periodic. We give criteria to determine the length of this Fermat period and show that for any natural number L and any b > 1 the number of primes having a peri...
متن کاملA role for generalized Fermat numbers
We define a Gauss factorial Nn! to be the product of all positive integers up to N that are relatively prime to n ∈ N. In this paper we study particular aspects of the Gauss factorials bn−1 M cn! for M = 3 and 6, where the case of n having exactly one prime factor of the form p ≡ 1 (mod 6) is of particular interest. A fundamental role is played by those primes p ≡ 1 (mod 3) with the property th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Comput.
دوره 71 شماره
صفحات -
تاریخ انتشار 2002